A linear time recognition algorithm for proper interval graphs
نویسندگان
چکیده
We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian cycle of G.
منابع مشابه
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
A circular-arc modelM = (C,A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, and if some point of C is not covered by any arc then M is an interval model. A (proper) (interval) circulararc graph is the intersection graph of a (proper) (interval) circular-arc model. Circular-arc graphs and their subclasses have ...
متن کاملCharacterization and recognition of proper tagged probe interval graphs
Interval graphs were used in the study of genomics by the famous molecular biologist Benzer. Later on probe interval graphs were introduced by Zhang as a generalization of interval graphs for the study of cosmid contig mapping of DNA. A tagged probe interval graph (briefly, TPIG) is motivated by similar applications to genomics, where the set of vertices is partitioned into two sets, namely, pr...
متن کاملClosed graphs are proper interval graphs
Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
متن کاملOn the Classes of Interval Graphs of Limited Nesting and Count of Lengths
In 1969, Roberts introduced proper and unit interval graphs and proved that these classes are equal. Natural generalizations of unit interval graphs called k-length interval graphs were considered in which the number of different lengths of intervals is limited by k. Even after decades of research, no insight into their structure is known and the complexity of recognition is open even for k = 2...
متن کاملA note on the Roberts characterization of proper and unit interval graphs
In this note, a constructive proof is given that the classes of proper interval graphs and unit interval graphs coincide, a result originally established by Fred S. Roberts. Additionally, the proof yields a linear-time and space algorithm to compute a unit interval representation, given a proper interval graph as input.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 87 شماره
صفحات -
تاریخ انتشار 2003